Load-Dependent Vehicle Routing Problem: A Heuristic Approach

In this paper, a vehicle routing problem for the delivery of frozen and chilled products is explored. The formulated as mixed integer programming model to minimize total load-dependent distance instead distance. an adaptation from energy-minimizing problem. addition formulation, Cluster-First-Route-Second-based heuristic approach developed alternative solution. performance both mathematical solved by commercial solver algorithm experimented on several standard instances. results show that although outperforms in terms computation time, quality its solutions fall short expectations. This implies opportunity further improvement.